The logic of causal propositions

Knowledge and the Logic of Local Propositions

An agent's limited view of the state of a distributed system may render globally diierent situations indistinguishable. A proposition is local for this agent whenever his view suuces to decide this proposition. Motivated by a framework for the development of distributed programs from knowledge-based speciications, we introduce a modal logic of local propositions , in which it is possible to qua...

Cathoristic logic: A modal logic of incompatible propositions

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a number of results such as compactness, a semantic characterisation of elementary equivalence, the existence of a quadratic-time decision procedure, and Brandom’s...

From C-Believed Propositions to the Causal Calculator

Default rules, unlike inference rules of classical logic, allow us to derive a new conclusion only when it does not conflict with the other available information. The best known example is the so-called commonsense law of inertia: in the absence of information to the contrary, properties of the world can be presumed to be the same as they were in the past. Making the idea of commonsense inertia...

Causal Logic

This paper proposes a logic for causal based on event trees. Event trees provide a natural and familiar framework for probability and decision theory, but they lack the modularity that would make them convenient models for a logic. Our logic overcomes this deficiency by elaborating the idea of an event tree to that of an event space. This is a space containing situations or instantaneous events...

Sets of Postulates for the Logic of Propositions*